Infinite-State High-Level MSCs: Model-Checking and Realizability

We consider three natural classes of infinite-state HMSCs: globally-cooperative, locally-cooperative and local-choice HMSCs. We show first that model-checking for globally-cooperative and locally-cooperative HMSCs is of the same complexity as for the class of finite state HMSCs. Surprisingly, model-checking local-choice HMSCs turns out to be exponentially more efficient in space than for locally-cooperative HMSCs. We also show that locally-cooperative and local-choice HMSCs can be implemented by communicating finite states machines with additional (constant) message data. Moreover, the implementation of local-choice HMSCs is deadlock-free and of linear-size.